3D Face Recognition by Deforming the Normal Face.

A New Intelligent Prediction Method for Grade Estimation.

A wavelet%2DPCA%2Dbased fingerprinting scheme for peer%2Dto%2Dpeer video file sharing.

Error analysis of quantised RSSI based sensor network localisation.



Multiple model iterative learning control.

Target tracking for mobile robot platforms via object matching and background anti%2Dmatching.

Robust 3D Face Recognition Based on Rejection and Adaptive Region Selection.

Photodynamic Therapy of New Amphiphilic Phthalocyanine Zinc Inhibits the Proliferation of Human Hepatoma Bel%2D7402 Cells through the Induction of Apoptosis.

Comparison of Permutation Entropy Index and Bispectral Index for Monitoring Effects of Anesthetic Drugs to Brain Activity.

Estimating Depth of Anesthesia with Sparsity Measure of EEG Data in Wavelet Domain.

Neural Mass Modeling for Multi%2DChannel EEG Synchronization Analyzing.

Searching for Rising Stars in Bibliography Networks.

Distributed cooperative coverage and connectivity maintenance for mobile sensing devices.

Searching for Rising Stars in Bibliography Networks.

Auto Mutual Information Analysis with Order Patterns for Epileptic EEG.

Effectively Answering Schema%2DFree XML Queries over Document%2DCentric Data.

Profiling of Mass Spectrometry Data for Ovarian Cancer Detection Using Negative Correlation Learning.

Estimating Nitrogen Status of Plant by Vis%2FNIR Spectroscopy and Mathematical Model.


Trusted Firmware Services Based on TPM.


A core%2Dattachment based method to detect protein complexes in PPI networks.

Empirical Research on Price Disperse of Two Kinds of Retailers in B2C Market.

Application of a group search optimization based Artificial Neural Network to machine condition monitoring.

Price Competition Between Mobile Commerce Retailers and Web Site Retailers.



A Unified Scoring Scheme for Detecting Essential Proteins in Protein Interaction Networks.

Broken Rotor Bars Fault Detection in Induction Motors Using Park%27s Vector Modulus and FWNN Approach.


Inferring Transcription Factor interactions using a novel HV%2DSVM classifier.


An HV%2DSVM Classifier to Infer TF%2DTF Interactions Using Protein Domains and GO Annotations.

Learning to Classify Documents with Only a Small Positive Training Set.

The Analysis of Bullwhip Effect in Supply Chain Based on Strategic Alliance.

Learning to Identify Unexpected Instances in the Test Set.

Profiling of High%2DThroughput Mass Spectrometry Data for Ovarian Cancer Detection.

Learning to Identify Unexpected Instances in the Test Set.

Application of Hybrid Pattern Recognition for Discriminating Paddy Seeds of Different Storage Periods Based on Vis%2FNIRS.

A Novel Approach to Pattern Recognition Based on PCA%2DANN in Spectroscopy.

Robust Stable Controller Design of Networked Closed%2Dloop Systems.

Wavelet Spectral Entropy for Indication of Epileptic Seizure in Extracranial EEG.

Systematic Gene Function Prediction Using a Fuzzy Nearest%2DCluster Method on Gene Expression Data.

Networking Property During Epileptic Seizure with Multi%2Dchannel EEG Recordings.

Systematic gene function prediction from gene expression data by using a fuzzy nearest%2Dcluster method.

Sensor network localisation based on sorted RSSI quantisation.

Improving domain%2Dbased protein interaction prediction using biologically%2Dsignificant negative dataset.

Application of grammar%2Dbased codes for lossless compression of digital mammograms.

Quantitative Analysis of the Varieties of Apple Using Near Infrared Spectroscopy by Principal Component Analysis and BP Model.

Cost%2Dsensitive classification with genetic programming.

Learning from Positive and Unlabeled Examples with Different Data Distributions.
Abstract. We study the problem of learning from positive and unlabeled examples. Although several techniques exist for dealing with this problem, they all assume that positive examples in the positive set P and the positive examples in the unlabeled set U are generated from the same distribution. This assumption may be violated in practice. For example, one wants to collect all printer pages from the Web. One can use the printer pages from one site as the set P of positive pages and use product pages from another site as U. One wants to classify the pages in U into printer pages and non-printer pages. Although printer pages from the two sites have many similarities, they can also be quite different because different sites often present similar products in different styles and have different focuses. In such cases, existing methods perform poorly. This paper proposes a novel technique A-EM to deal with the problem. Experiment results with product page classification demonstrate the effectiveness of the proposed technique. 1
Application of Fuzzy Similarity to Prediction of Epileptic Seizures Using EEG Signals.

Protein Interaction Prediction Using Inferred Domain Interactions and Biologically%2DSignificant Negative Dataset.

A Sorted RSSI Quantization Based Algorithm for Sensor Network Localization.

Cramer%2DRao Bound Analysis of Quantized RSSI Based Localization in Wireless Sensor Networks.

Cramer%2DRao Bound Analysis of Quantized RSSI Based Localization in Wireless Sensor Networks.

Strength and Direction of Phase Synchronization of Neural Networks.

Detection of Epileptic Spikes with Empirical Mode Decomposition and Nonlinear Energy Operator.

Text Classification by Labeling Words.
Traditionally, text classifiers are built from labeled training examples. Labeling is usually done manually by human experts (or the users), which is a labor intensive and time consuming process. In the past few years, researchers investigated various forms of semi-supervised learning to reduce the burden of manual labeling. In this paper, we propose a different approach. Instead of labeling a set of documents, the proposed method labels a set of representative words for each class. It then uses these words to extract a set of documents for each class from a set of unlabeled documents to form the initial training set. The EM algorithm is then applied to build the classifier. The key issue of the approach is how to obtain a set of representative words for each class. One way is to ask the user to provide them, which is difficult because the user usually can only give a few words (which are insufficient for accurate learning). We propose a method to solve the problem. It combines clustering and feature selection. The technique can effectively rank the words in the unlabeled set according to their importance. The user then selects/labels some words from the ranked list for each class. This process requires less effort than providing words with no help or manual labeling of documents. Our results show that the new method is highly effective and promising.
A Map%2Dgrowing Localization Algorithm for Ad%2Dhoc Wireless Sensor Networks.

Classifying Biomedical Citations without Labeled Training Examples.

A Map%2Dgrowing Localization Algorithm for Ad%2Dhoc Wireless Sensor Networks.

A Hybrid Radial Basis Function Neural Network for Dimensional Error Prediction in End Milling.

Dealing with different distributions in learning from.

Learning to Classify Texts Using Positive and Unlabeled Data.%2
In traditional text classification, a classifier is built using labeled training documents of every class. This paper studies a different problem. Given a set P of documents of a particular class (called positive class) and a set U of unlabeled documents that contains documents from class P and also other types of documents (called negative class documents), we want to build a classifier to classify the documents in U into documents from P and documents not from P. The key feature of this problem is that there is no labeled negative document, which makes traditional text classification techniques inapplicable. In this paper, we propose an effective technique to solve the problem. It combines the Rocchio method and the SVM technique for classifier building. Experimental results show that the new method outperforms existing methods significantly. 1
Building Text Classifiers Using Positive and Unlabeled Examples.
This paper studies the problem of building text classifiers using positive and unlabeled examples. The key feature of this problem is that there is no negative example for learning. Recently, a few techniques for solving this problem were proposed in the literature. These techniques are based on the same idea, which builds a classifier in two steps. Each existing technique uses a different method for each step. In this paper, we first introduce some new methods for the two steps, and perform a comprehensive evaluation of all possible combinations of methods of the two steps. We then propose a more principled approach to solving the problem based on a biased formulation of SVM, and show experimentally that it is more accurate than the existing techniques. 1.
Learning to Classify Texts Using Positive and Unlabeled Data.%2
In traditional text classification, a classifier is built using labeled training documents of every class. This paper studies a different problem. Given a set P of documents of a particular class (called positive class) and a set U of unlabeled documents that contains documents from class P and also other types of documents (called negative class documents), we want to build a classifier to classify the documents in U into documents from P and documents not from P. The key feature of this problem is that there is no labeled negative document, which makes traditional text classification techniques inapplicable. In this paper, we propose an effective technique to solve the problem. It combines the Rocchio method and the SVM technique for classifier building. Experimental results show that the new method outperforms existing methods significantly. 1


Using micro information units for internet search.
Internet search is one of the most important applications of the Web. A search engine takes the user’s keywords to retrieve and to rank those pages that contain the keywords. One shortcoming of existing search techniques is that they do not give due consideration to the micro-structures of a Web page. A Web page is often populated with a number of small information units, which we call micro information units (MIU). Each unit focuses on a specific topic and occupies a specific area of the page. During the search, if all the keywords in the user query occur in a single MIU of a page, the top ranking results returned by a search engine are generally relevant and useful. However, if the query words scatter at different MIUs in a page, the pages returned can be quite irrelevant (which causes low precision). The reason for this is that although a page has information on individual MIUs, it may not have information on their intersections. In this paper, we propose a technique to solve this problem. At the off-line preprocessing stage, we segment each page to identify the MIUs in the page, and index the keywords of the page according to the MIUs in which they occur. In searching, our retrieval and ranking algorithm utilizes this additional information to return those most relevant pages. Experimental results show that this method is able to significantly improve the search precision. 1.
Partially Supervised Classification of Text Documents.
We investigate the following problem: Given a set  of documents of a particular topic or class # , and a  large set # of mixed documents that contains documents  from class # and other types of documents,  identify the documents from class # in # . The key  feature of this problem is that there is no labeled non-  # document, which makes traditional machine learning  techniques inapplicable, as they all need labeled  documents of both classes. We call this problem partially  supervised classification. In this paper, we show  that this problem can be posed as a constrained optimization  problem and that under appropriate conditions,  solutions to the constrained optimization problem  will give good solutions to the partially supervised  classification problem. We present a novel technique  to solve the problem and demonstrate the effectiveness  of the technique through extensive experimentation.
A refinement approach to handling model misfit in text categorization.
Text categorization or classification is the automated assigning of text documents to pre-defined classes based on their contents. This problem has been studied in information retrieval, machine learning and data mining. So far, many effective techniques have been proposed. However, most techniques are based on some underlying models and/or assumptions. When the data fits the model well, the classification accuracy will be high. However, when the data does not fit the model well, the classification accuracy can be very low. In this paper, we propose a refinement approach to dealing with this problem of model misfit. We show that we do not need to change the classification technique itself (or its underlying model) to make it more flexible. Instead, we propose to use successive refinements of classification on the training data to correct the model misfit. We apply the proposed technique to improve the classification performance of two simple and efficient text classifiers, the Rocchio classifier and the nave Bayesian classifier. These techniques are suitable for very large text collections because they allow the data to reside on disk and need only one scan of the data to build a text classifier. Extensive experiments on two benchmark document corpora show that the proposed technique is able to improve text categorization accuracy of the two techniques dramatically. In particular, our refined model is able to improve the nave Bayesian or Rocchio classifier&#039;s prediction performance by 45% on average.
Innovating Web Page Classification Through Reducing Noise.

A Document Classifier Based on Word Semantic Association.

Real%2Dtime tool condition monitoring using wavelet transforms and fuzzy techniques.
In this paper, wavelet transforms and fuzzy techniques are used to monitor tool breakage and wear conditions in real time according to the measured spindle and feed motor currents, respectively. First, the continuous and discrete wavelet transforms are used to decompose the spindle and feed ac servo motor current signals to extract signal features so as to detect the breakage of drills successfully. Next, the models of the relationships between the current signals and the cutting parameters are established under different tool wear states. Subsequently, fuzzy classification methods are used to detect tool wear states based on the above models. Finally, the two methods above are integrated to establish an intelligent tool condition monitoring system for drilling operations. The monitoring system can detect tool breakage and tool wear conditions using very simple current sensors. Experimental results show that the proposed system can reliably detect tool conditions in drilling operations in real time and is viable for industrial applications.
